Aggregating non-finite families of T-transitive relations
نویسندگان
چکیده
Aggregation of non-finite families of transitive relations is studied and applied to calculate the degrees of inclusion and similarity of fuzzy quantities (fuzzy subsets of an interval of the real line).
منابع مشابه
Sharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملCounting Transitive Relations
In order to count partial orders on a set of n points, it seems necessary to explicitly construct a representative of every isomorphism type. While that is done, one might as well determine their automorphism groups. In this note it is shown how several other types of binary relations can be counted, based on an explicit enumeration of the partial orders and their automorphism groups. A partial...
متن کاملTransitive Closure of Interval-valued Fuzzy Relations
In this paper are introduced some concepts of interval-valued fuzzy relations and some of their properties: reflexivity, symmetry, T-transitivity, composition and local reflexivity. The existence and uniqueness of T-transitive closure of interval-valued fuzzy relations is proved. An algorithm to compute the T-transitive closure of finite interval-valued fuzzy relations is showed. Some propertie...
متن کاملAn outline of the dissertation ,,Arithmetics in finite but potentially infinite worlds”
In the dissertation we examine logical properties of finite arithmetics. Finite models with built-in arithmetical relations have gained an attention due to their ability to express concepts related to computational complexity. It was shown, for example, that the logic with the fixed point operator expresses on models with linear order exactly those properties which are computable in determinist...
متن کاملON FINITE GROUPS IN WHICH SS-SEMIPERMUTABILITY IS A TRANSITIVE RELATION
Let H be a subgroup of a finite group G. We say that H is SS-semipermutable in Gif H has a supplement K in G such that H permutes with every Sylow subgroup X of Kwith (jXj; jHj) = 1. In this paper, the Structure of SS-semipermutable subgroups, and finitegroups in which SS-semipermutability is a transitive relation are described. It is shown thata finite solvable group G is a PST-group if and on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003